Norm Comparisons for Data Augmentation
نویسندگان
چکیده
This short paper considers comparisons of different data augmentation algorithms in terms of their convergence and efficiency. It examines connections between the partial order 1 on Markov kernels, and inequalities of operator norms. It applies notions from Roberts and Rosenthal (2006) related to variance bounding Markov chains, together with L2 theory, to data augmentation algorithms (Tanner and Wong, 1987; Liu and Wu, 1999; Meng and van Dyk, 1999; Hobert and Marchev, 2006). In particular, our main result, Theorem 10, is a direct generalisation of one of the theorems in Hobert and Marchev (2006).
منابع مشابه
Spectral Analytic Comparisons for Data Augmentation
The sandwich algorithm (SA) is an alternative to the data augmentation (DA) algorithm that uses an extra simulation step at each iteration. In this paper, we show that the sandwich algorithm always converges at least as fast as the DA algorithm, in the Markov operator norm sense. We also establish conditions under which the spectrum of SA dominates that of DA. An example illustrates the results.
متن کاملCovariance structure of the Gibbs sampler with applications to the comparisons of estimators and augmentation schemes
We study the covariance structure of a Markov chain generated by the Gibbs sampler, with emphasis on data augmentation. When applied to a Bayesian missing data problem, the Gibbs sampler produces two natural approximations for the posterior distribution of the parameter vector: the empirical distribution based on the sampled values of the parameter vector, and a mixture of complete data posteri...
متن کاملStability and L2-Norm Bound Conditions for Takagi-Sugeno Descriptor Systems
i λi(t)A ∗ i ) with a common matrix E . The approach they have used is based on a state augmentation. In this paper, it is proved that this transformation introduces impulsive terms, because time derivate of the state variables are added in the state vector. The major contribution of this paper is to avoid this state augmentation. A new sufficient stability condition is established. Stability w...
متن کاملNormative comparisons for large neuropsychological test batteries: User-friendly and sensitive solutions to minimize familywise false positives.
INTRODUCTION In neuropsychological research and clinical practice, a large battery of tests is often administered to determine whether an individual deviates from the norm. We formulate three criteria for such large battery normative comparisons. First, familywise false-positive error rate (i.e., the complement of specificity) should be controlled at, or below, a prespecified level. Second, sen...
متن کاملA theoretical comparison of the data augmentation, marginal augmentation and PX-DA algorithms
The data augmentation (DA) algorithm is a widely used Markov chain Monte Carlo (MCMC) algorithm that is based on a Markov transition density of the form p(x|x′) = ∫ Y fX|Y (x|y)fY |X(y|x) dy, where fX|Y and fY |X are conditional densities. The PX-DA and marginal augmentation algorithms (Liu and Wu, 1999; Meng and van Dyk, 1999) are alternatives to DA that often converge much faster and are only...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2007